The troublesome probabilistic powerdomain

نویسندگان

  • Achim Jung
  • Regina Tix
چکیده

In [12] it is shown that the probabilistic powerdomain of a continuous domain is again continuous. The category of continuous domains, however, is not cartesian closed, and one has to look at subcategories such as RB, the retracts of bifinite domains. [8] offers a proof that the probabilistic powerdomain construction can be restricted to RB. In this paper, we give a counterexample to Graham’s proof and describe our own attempts at proving a closure result for the probabilistic powerdomain construction. We have positive results for finite trees and finite reversed trees. These illustrate the difficulties we face, rather than being a satisfying answer to the question of whether the probabilistic powerdomain and function spaces can be reconciled. We are more successful with coherent or Lawson-compact domains. These form a category with many pleasing properties but they fall short of supporting function spaces. Along the way, we give a new proof of Jones’ Splitting Lemma.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces

For the semantics of probabilistic features in programming mainly two approaches are used for building models. One is the Giry monad of Borel probability measures over metric spaces, and the other is Jones’ probabilistic powerdomain monad [6] over dcpos (directed complete partial orders). This paper places itself in the second domain theoretical tradition. The probabilistic powerdomain monad is...

متن کامل

QRB-Domains and the Probabilistic Powerdomain

Is there any cartesian-closed category of continuous domains that would be closed under Jones and Plotkin’s probabilistic powerdomain construction? This is a major open problem in the area of denotational semantics of probabilistic higher-order languages. We relax the question, and look for quasi-continuous dcpos instead. We introduce a natural class of such quasi-continuous dcpos, the !QRB-dom...

متن کامل

A Probabilistic Powerdomain of Evaluations

We give a probabilistic powerdomain construction on the category of inductively complete partial orders; it is the partial order of continuous [0, 11-valued evaluations on the Scott topology. By means of a theory of integration with respect to such evaluations, the powerdomain is shown to be a monad, and indeed one gets a model for Moggi’s computational lambda-calculus. One can also solve recur...

متن کامل

Domain Theory and its Applications

Michael Baldamus An Elementary Set–Theoretic Semantics for the π–Calculus . . . . . . . . . . . 6 Andrej Bauer Recursive Analysis in PER(PN) . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 Eike Best Relational Semantics Revisited . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 Marcello Bonsague Infinitary Logic of Domains . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 13  شماره 

صفحات  -

تاریخ انتشار 1998